#include "HeapSort.h"

void test ()
{

    int arr [] = { 1 , 3 , 5 , 7 , 9 , 2 , 4 , 6 , 8 , 0} ;

    int n = sizeof (arr) / sizeof (arr [0]) ;

    printf ("排序之前: ") ;

    HeapPrint (arr , n) ;

    int size = sizeof (int) ;

    HeapSort (arr , n , size) ;

    printf ("排序之后: ")  ;

    HeapPrint (arr , n) ;

}

int main ()
{

    test () ;

    return 0 ;

}